Special Issue of the Journal of Parallel and Distributed Computing: Transactional Memory
نویسنده
چکیده
Background and Scope Parallel programming in the multicore era is a challenging task, and novel approaches are needed to ease the development of parallel applications. Transactional memory has been proposed as an alternative to the traditional lock-based approach to express and manage concurrency. During the last few years we have seen an increasing interest in programming languages, run-time systems, and hardware to support transactional memory, speculative concurrency, and failure atomicy. The scope of this JPDC special issue on Transactional Memory is intentionally broad in order to cover a wide range of aspects and capture the state-of-the-art of an emerging area. Further, many aspects, from the hardware level, run-time and operating systems, compilers, and up to the application level, must be addressed for transactional memory to become viable and widely accepted.
منابع مشابه
Green Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملDesigning a Distributed Software Transactional Memory System
Distributed systems are widely used in high performance computing for performing computationally extensive calculations. In programming terms, distributed systems have usually been exploited through the use of dedicated APIs such as OpenMP and MPI. With these programming models, synchronization is achieved using locks and barriers, and is complex to implement correctly. Transactional memory is ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملTransactional Distributed Memory Management for Cluster Operating Systems
Memory management is a crucial component of distributed operating systems. Our paper presents design and functionality of the memory management package for Rainbow OS (a 64-Bit transactional distributed memory (TDM) operating system for PC-clusters). To support efficient parallel computing on distributed objects several consistency models and multicore operation is provided. Even when using rel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 69 شماره
صفحات -
تاریخ انتشار 2009